Simple Assembly Line Balancing Problem ( SALBP ) , Type 2
نویسنده
چکیده
SALBP is an NP-hard problem. There are some measures proposed to grasp the difficulty of SALBP. Order Strength, Flexibility Ratio and West Ratio all of which are based on SALBP precedence networks are among them. This study investigates the sensitivity of difficulty of SALBP type 2 to the three measures. A SALBP solver is created in Python programming language. Computational experiments are conducted.
منابع مشابه
A new heuristic method based on CPM in SALBP
The task of balancing of assembly lines is well-known in mass production system but this problem is NP-hard even for the simple straight line. Therefore, utilizing heuristic methods for these problems is totally unquestionable. Furthermore, in line with balancing problems, heuristic methods are the foundation of the metaheuristic methods, thus it seems to be necessary to use more efficient heur...
متن کاملAbsalom: Balancing assembly lines with assignment restrictions
Assembly line balancing problems (ALBPs) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing products among the work stations along the line. On the one hand, research has focussed on developing effective and fast solution methods for exactly solving the simple assembly line balancing problem (SALBP). On th...
متن کاملIterative Beam Search for Simple Assembly Line Balancing with a Fixed Number of Work Stations
The simple assembly line balancing problem (SALBP) concerns the assignment of tasks with pre-defined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be respected. The optimization goal of the SALBP-2 version of the problem concerns the minimization of the so-called cycle time, that is, the time in which the tasks of each work ...
متن کاملRecent Results on Stability Analysis of an Optimal Assembly Line Balance
Two assembly line balancing problems are addressed. The first problem (called SALBP-1) is to minimize number of linearly ordered stations for processing n partially ordered operations V = {1, 2, ..., n} within the fixed cycle time c. The second problem (called SALBP-2) is to minimize cycle time for processing partially ordered operations V on the fixed set of m linearly ordered stations. The pr...
متن کاملA multi-objective genetic algorithm for a mixed-model assembly U-line balancing type-I problem considering human-related issues, training, and learning
Mixed-model assembly lines are increasingly accepted in many industrial environments to meet the growing trend of greater product variability, diversification of customer demands, and shorter life cycles. In this research, a new mathematical model is presented considering balancing a mixed-model U-line and human-related issues, simultaneously. The objective function consists of two separate com...
متن کامل